A Simplified Semantics for a Fragment of Intuitionistic Linear Logic
نویسنده
چکیده
We introduce a simplified Kripke type semantics for the {→,∧, ∗, !,1}-fragment of intuitionistic linear logic, and prove a completeness theorem with respect to the semantics by using a simple and intuitive canonical model.
منابع مشابه
AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملThe Undecidability of Second Order Linear Logic Without Exponentials
Recently, Lincoln, Scedrov and Shankar showed that the multi-plicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-addit...
متن کاملAxiomatic systems and topological semantics for intuitionistic temporal logic
We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics features a new interpretation for the ‘henceforth’ modality that is a natural intuitionistic variant of the classical one. Using the soundness results, we show ...
متن کاملThe Finite Model Property for Various Fragments of Linear Logic
To show that a formula A is not provable in propositional classical logic, it suuces to exhibit a nite boolean model which does not satisfy A. A similar property holds in the intuitionistic case, with Kripke models instead of boolean models (see for instance TvD88]). One says that the propositional classical logic and the propositional intuitionistic logic satisfy a nite model property. In part...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کامل